منابع مشابه
On the Complexity of Some Common Geometric Location Problems
Given n demand points in the plane, the p-center problem is to find p supply points (anywhere in the plane) so as to minimize the maximum distance from a demo& point to its respective nearest supply point. The p-median problem is to minimize the sum of distances from demand points to their respective nearest supply points. We prove that the p-center and the p-media problems relative to both the...
متن کاملNoniterative Solution of Some Fermat-Weber Location Problems
The Fermat-Weber problem of optimally locating a service facility in the Euclidean continuous two-dimensional space is usually solved by the iterative process first suggested by Weiszfeld or by later versions thereof. The methods are usually rather efficient, but exceptional problems are described in the literature in which the iterative solution is exceedingly long. These problems are such tha...
متن کاملOn Some Optimization Problems in Obnoxious Facility Location
In this paper we study the following general MaxMinoptimization problem concerning undesirable (obnoxious) facility location: Given a set of n sites S inside a convex region P , construct m garbage deposit sites Vm such that the minimum distance between these sites Vm and the union of S and Vm, Vm∪S, is maximized. We present a general method using Voronoi diagrams to approximately solve two suc...
متن کاملTotal Dual Integrality in Some Facility Location Problems
Facility location, arising in a rich variety of applications, has been studied extensively in the fields of operations research and computer science. In this note we consider the classical uncapacitated facility location problem and its “prize-collecting” variant introduced by Bäıou and Barahona, and show that the linear systems associated with these problems are totally dual integral (TDI) if ...
متن کاملParameterized Approximation Algorithms for Some Location Problems in Graphs
We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) r-Domination problem and the (Connected) p-Center problem for unweighted and undirected graphs. Given a graph G, we show how to construct a (connected) ( r +O(μ) ) dominating set D with |D| ≤ |D∗| efficiently. Here, D∗ is a minimum (connected) r-dominating set of G and μ is our graph parameter,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japanese Journal of Human Geography
سال: 1958
ISSN: 1883-4086,0018-7216
DOI: 10.4200/jjhg1948.9.467